PGV-Style Block-Cipher-Based Hash Families and Black-Box Analysis

نویسندگان

  • Wonil Lee
  • Mridul Nandi
  • Palash Sarkar
  • Donghoon Chang
  • Sangjin Lee
  • Kouichi Sakurai
چکیده

In [1] it was proved that 20 of 64 PGV hash functions [2] based on block cipher are collision-resistant and one-way in the black-box model of the underlying block cipher. Here, we generalize the definition of PGV-hash function into a hash family and we will prove that, aside from the previously reported 20 hash functions, we have 22 more collision-resistant and one-way hash families. As all these 42 families are keyed hash family, these are also target-collision-resistant. All these 42 hash families have tight upper and lower bounds on (target) collision-resistant and one-wayness. key words: hash function, block cipher, black-box model, provable security

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Generalization of PGV-Hash Functions and Security Analysis in Black-Box Model

In [1] it was proved that 20 out of 64 PGV-hash functions [2] based on block cipher are collision resistant and one-way-secure in blackbox model of the underlying block cipher. Here, we generalize the definition of PGV-hash function into a hash family and prove that besides the previous 20 hash functions we have 22 more collision resistant and one-way secure hash families. As all these 42 famil...

متن کامل

Black-Box Analysis of the Block-Cipher-Based Hash-Function Constructions from PGV

Preneel, Govaerts, and Vandewalle [7] considered the 64 most basic ways to construct ahash function H: {0, 1}∗ → {0, 1} from a block cipher E: {0, 1} × {0, 1} → {0, 1}. Theyregarded 12 of these 64 schemes as secure, though no proofs or formal claims were given. Theremaining 52 schemes were shown to be subject to various attacks. Here we provide a formaland quantitative treat...

متن کامل

Revised: Block Cipher Based Hash Function Construction From PGV

Preneel, Govaerts, and Vandewalle[12] considered the 64 most basic ways to construct a hash function from a block cipher, and regarded 12 of these 64 schemes as secure. Black, Pogaway and Shrimpton[3] proved that, in black-box model, the 12 schemes that PGV singled out as secure really are secure and given tight upper and lower bounds on their collision resistance. And also they pointed out, by...

متن کامل

Improved Collision and Preimage Resistance Bounds on PGV Schemes

Preneel, Govaerts, and Vandewalle[14](PGV) considered 64 most basic ways to construct a hash function from a block cipher, and regarded 12 of those 64 schemes as secure. Black, Pogaway and Shrimpton[3](BRS) provided a formal and quantitative treatment of those 64 constructions and proved that, in black-box model, the 12 schemes ( group − 1 ) that PGV singled out as secure really are secure. By ...

متن کامل

Do We Need to Vary the Constants? (Methodological Investigation of Block-Cipher Based Hash Functions)

The recent collision attacks on the MD hash function family do not depend on the constants used in the function, but rather on its structure (i.e., changing the constants will not affect the differential analysis based attacks). Thus, is seems that the role of constants in maintaining security and preventing these attacks is unclear, at best, for this case and in particular fixing or varying th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IEICE Transactions

دوره 88-A  شماره 

صفحات  -

تاریخ انتشار 2005